翻訳と辞書 Words near each other ・ Quadrathlon ・ Quadratic ・ Quadratic (collection) ・ Quadratic algebra ・ Quadratic assignment problem ・ Quadratic bottleneck assignment problem ・ Quadratic classifier ・ Quadratic configuration interaction ・ Quadratic differential ・ Quadratic eigenvalue problem ・ Quadratic equation ・ Quadratic field ・ Quadratic form ・ Quadratic form (statistics) ・ Quadratic formula ・ Quadratic Frobenius test ・ Quadratic function ・ Quadratic Gauss sum ・ Quadratic growth ・ Quadratic integer ・ Quadratic integral ・ Quadratic integrate and fire ・ Quadratic irrational ・ Quadratic Jordan algebra ・ Quadratic Lie algebra ・ Quadratic mean diameter ・ Quadratic pair ・ Quadratic probing ・ Quadratic programming ・ Quadratic reciprocity Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Quadratic Frobenius test ： ウィキペディア英語版 Quadratic Frobenius test The Quadratic Frobenius Test (QFT) is a probabilistic primality test to test whether a number is a probable prime. It is named after Ferdinand Georg Frobenius. The test uses the concepts of quadratic polynomials and the Frobenius automorphism. It should not be confused with the more general Frobenius test using a quadratic polynomial -- the QFT restricts the polynomials allowed based on the input, and also has other conditions that must be met. A composite passing this test is a Frobenius pseudoprime, but the converse is not necessarily true. ==Concept== Grantham's stated goal when developing the algorithm was to provide a test that primes would always pass and composites would pass with a probability of less than 1/7710. The test was later extended by Damgård and Frandsen to a test called ''Extended Quadratic Frobenius Test'' (EQFT). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Quadratic Frobenius test」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.